Infinite permutations vs. infinite words

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Infinite permutations vs. infinite words

I am going to compare well-known properties of infinite words with those of infinite permutations, a new object studied since middle 2000s. Basically, it was Sergey Avgustinovich who invented this notion, although in an early study by Davis et al. [4] permutations appear in a very similar framework as early as in 1977. I am going to tell about periodicity of permutations, their complexity accor...

متن کامل

Representations of Infinite Permutations by Words (ii)

We present an argument (due originally to R. C. Lyndon) which completes the proof of the following theorem: Every free group word which is not a proper power can represent any permutation of an infinite set.

متن کامل

Representations of Infinite Permutations by Words

We prove several cases of the following theorem: Every free group word which is not a proper power can represent every permutation of an infinite set. The remaining cases will be proved in a forthcoming paper of R. C. Lyndon. Fx denotes a free group freely generated by the set A. The elements of X are called letters, and the elements of Fx are represented by reduced words in those letters. G de...

متن کامل

On automatic infinite permutations

An infinite permutation α is a linear ordering of N. We study properties of infinite permutations analogous to those of infinite words, and show some resemblances and some differences between permutations and words. In this paper, we try to extend to permutations the notion of automaticity. As we shall show, the standard definitions which are equivalent in the case of words are not equivalent i...

متن کامل

An Infinite Antichain of Permutations

We constructively prove that the partially ordered set of finite permutations ordered by deletion of entries contains an infinite antichain.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science

سال: 2011

ISSN: 2075-2180

DOI: 10.4204/eptcs.63.2